Secure message transmission in the presence of a fully generalised adversary
نویسنده
چکیده
We investigate the problem of secure message transmission in the presence of a ‘fully generalised’ adversary, who disrupts and listens to separate sets of communication wires. We extend previous results by considering the case when these sets may have arbitrary size, providing necessary and sufficient conditions for both one-way and two-way communication.
منابع مشابه
Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality
In this paper, we study the problem of probabilistic perfectly reliable message transmission (PPRMT) and probabilistic perfectly secure message transmission (PPSMT) between a sender S and a receiver R in a synchronous network, where S and R are connected by n vertex disjoint paths called wires. Some of these n wires may be corrupted by a mixed adversary (tb, to, tf , tp), having unbounded compu...
متن کاملSimple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
Patra et al. [25] gave a necessary and sufficient condition for the possibility of almost perfectly secure message transmission protocols tolerating general, non-threshold Q adversary structure. However, their protocol requires at least three rounds and performs exponential (exponential in the size of the adversary structure) computation and communication. Moreover, they have left it as an open...
متن کاملNetwork Connection and Perfectly Secure Message Transmission on Wireless Mobile Networks
In this paper we proposed perfectly secure message transmission for reliable and secure communications in order to ensure that an adversary cannot obtain information (in the information theoretic sense) about messages. There are numerous studies about the interplay of network connectivity and perfectly secure message transmission under a Byzantine adversary capable of corrupting up to t players...
متن کاملUnconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
In this paper, we re-visit the problem of unconditionally reliable message transmission (URMT) and unconditionally secure message transmission (USMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbounded computing power. Desmedt et.al [5] have given the necessary and sufficient condition for the existence of URMT and USMT protocols in directed ne...
متن کاملCryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)
We consider the model of unconditionally secure (r-round, n-channel) message transmission schemes which was introduced by Dolev et al. [1]. In this model, there are n channels between a sender and a receiver, and an infinitely powerful adversary A may corrupt (observe and forge) the messages sent through t out of n channels. The sender wishes to send a secret s to the receiver in r-round withou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Mathematical Cryptology
دوره 9 شماره
صفحات -
تاریخ انتشار 2015